Making Transport Safer: V2V-Based Automated Emergency Braking System

An important goal in the field of intelligent transportation systems (ITS) is to provide driving aids aimed at preventing accidents and reducing the number of traffic victims. The commonest traffic accidents in urban areas are due to sudden braking that demands a very fast response on the part of drivers. Attempts to solve this problem have motivated many ITS advances including the detection of the intention of surrounding cars using lasers, radars or cameras. However, this might not be enough to increase safety when there is a danger of collision. Vehicle to vehicle communications are needed to ensure that the other intentions of cars are also available. The article describes the development of a controller to perform an emergency stop via an electro-hydraulic braking system employed on dry asphalt. An original V2V communication scheme based on WiFi cards has been used for broadcasting positioning information to other vehicles. The reliability of the scheme has been theoretically analyzed to estimate its performance when the number of vehicles involved is much higher. This controller has been incorporated into the AUTOPIA program control for automatic cars. The system has been implemented in Citroën C3 Pluriel, and various tests were performed to evaluate its operation

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographical positions have been used, located in the province of Bizkaia, Spain. For the proper treatment of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed. This application is the first application of the firefly algorithm to any rich vehicle routing problem. To prove that the proposed DFA is a promising technique, its performance has been compared with two other well-known techniques: an evolutionary algorithm and an evolutionary simulated annealing. Our results have shown that the DFA has outperformed these two classic meta-heuristics

Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems

Researchers who investigate in any area related to computational algorithms (both dening new algorithms or improving existing ones) usually nd large diculties to test their work. Comparisons among dierent researches in this eld are often a hard task, due to the ambiguity or lack of detail in the presentation of the work and its results. On many occasions, the replication of the work conducted by other researchers is required, which leads to a waste of time and a delay in the research advances. The authors of this study propose a procedure to introduce new techniques and their results in the eld of routing problems. In this paper this procedure is detailed, and a set of good practices to follow are deeply described. It is noteworthy that this procedure can be applied to any combinatorial optimization problem. Anyway, the literature of this study is focused on routing problems. This eld has been chosen because of its importance in real world, and its relevance in the actual literature

Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms.

Osoba E. et al have discussed our method to solve the Traveling Salesman Problem pointing that we use our developed new algorithm to compare different versions of a classical genetic algorithm, each of one with a different mutation operator and they write that this can generate some controversy. Here we shortly analyze the comment of Osaba E. et al. to show that our comparing method has a chance of existence. Keywords: Genetic algorithms, Traveling Salesman Problem, algorithm Greedy Sub Tour Mutation (GSTM). Analysis: We can classify the proposals Osaba E. and others four class: (1) Comparison and evaluation of the Greedy and Normal mutation methods together are not correct (it is wrong). As stated in our article "Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms" [1] our new mutation algorithm Greedy Sub Tour Mutation (GSTM) has a hybrid structure. GSTM operator acts as a greedy, at the same time include the operators of Simple Inversion Mutation (SIM) and Scramble Mutation (SCM). Also if you look at the values of PRC = 0.5, PCP = 0.8, as used in our analysis it can be seen that the probability of using GSTM classical operators is larger. In this case we can say that the comparison of operators GSTM greedy and classic is applied properly. (2) Compare with Non-Sequential 4-Change that is described in literature Therefore, to compare our method with the mutation method developed in this article is not proper. (3) It is confirmed that all greedy methods are used together (NN + DPX). So which of these methods have a success is not clear. All of Genetic Algorithms in the analysi

Crossover vs. Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Since their first formulation, genetic algorithms (GA) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GA is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test

Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test

Automatic lateral control for unmanned vehicles via genetic algorithms

It is known that the techniques under the topic of Soft Computing have a strong capability of learning and cognition, as well as a good tolerance to uncertainty and imprecision. Due to these properties they can be applied successfully to Intelligent Vehicle Systems; ITS is a broad range of technologies and techniques that hold answers to many transportation problems. The unmannedcontrol of the steering wheel of a vehicle is one of the most important challenges facing researchers in this area. This paper presents a method to adjust automatically a fuzzy controller to manage the steering wheel of a mass-produced vehicle; to reach it, information about the car state while a human driver is handling the car is taken and used to adjust, via iterative geneticalgorithms an appropriated fuzzy controller. To evaluate the obtained controllers, it will be considered the performance obtained in the track following task, as well as the smoothness of the driving carried out

Smart ICTs for the enhancement of traffic logistics in the Port of Seville

Las ponencias del congreso pueden descargarse desde: http://www.pianc.org.ar/_stage/papers_in.phpThis paper focuses in the optimization of intermodal transport by the development of a freight geolocation and telecontrol platform for intermodal transport. This system, Cooperative Unitized Tracking System (CUTS), is being developed under the project TECNOPORT2025, which is an initiative of the Port Authority of Seville (PAS), co-funded by the European Commission by means of the ERDF (European Region Development Funds), under the Pre-commercial Public Procurement model aiming the “Port of Future”